Fast and Scalable Relational Division on Database Systems
نویسندگان
چکیده
The Relational Algebra is composed of several operators to assist queries and data manipulation on Relational Databases. The Relational Division operator, particularly, allows simple representations of several queries involving the concept of “for all”, however, the SQL does not have an explicit implementation for it. In this paper, we compare the performance of the best implementation known for the division operator in SQL, considering different cases of use. We also present a new algorithm for the division, which we implemented through stored procedures. We performed a case study using the relational division to select genetic data. The results showed that our implementation for the relational division is potentially faster than the best implementation in SQL.
منابع مشابه
ON A LOSSY IMAGE COMPRESSION/RECONSTRUCTION METHOD BASED ON FUZZY RELATIONAL EQUATIONS
The pioneer work of image compression/reconstruction based onfuzzy relational equations (ICF) and the related works are introduced. TheICF regards an original image as a fuzzy relation by embedding the brightnesslevel into [0,1]. The compression/reconstruction of ICF correspond to thecomposition/solving inverse problem formulated on fuzzy relational equations.Optimizations of ICF can be consequ...
متن کاملFactorBase: SQL for Learning A Multi-Relational Graphical Model
We describe FACTORBASE , a new SQL-based framework that leverages a relational database management system to support multi-relational model discovery. A multi-relational statistical model provides an integrated analysis of the heterogeneous and interdependent data resources in the database. We adopt the BayesStore design philosophy: statistical models are stored and managed as first-class citiz...
متن کاملA Scalable XML Access Control System
This paper presents the design of a scalable XML access control system. The system has the following features. First, it can regulate access control at a ne graularity (e.g., at the tag level). Second, it stores XML documents as tables in relational databases. Third, it is eÆcient compared to existing systems as it only examines the relevant data. Fourth, it is scalable as it can handle very la...
متن کاملPathfinder: XQuery compilation techniques for relational database targets
Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as well as the W3C XQuery language definition, can turn relational databases into fast and scalable XML processors. This work shows how the deliberate choice of a relational tree encoding makes the XML data model—ordered, unr...
متن کاملOn Scalable and Flexible Transaction and Query Processing in Main-Memory Database Systems
The hardware landscape for database systems has changed dramatically over the past two decades. Today, the traditional database system architecture that was pioneered by System R and is implemented by IBM DB2, Microsoft SQL Server, Oracle and Postgres, shows weaknesses in all major areas of application of commercial database systems: operational transaction processing, decision support and busi...
متن کامل